251 research outputs found
A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization
In this paper, we propose a convergent parallel best-response algorithm with
the exact line search for the nondifferentiable nonconvex sparsity-regularized
rank minimization problem. On the one hand, it exhibits a faster convergence
than subgradient algorithms and block coordinate descent algorithms. On the
other hand, its convergence to a stationary point is guaranteed, while ADMM
algorithms only converge for convex problems. Furthermore, the exact line
search procedure in the proposed algorithm is performed efficiently in
closed-form to avoid the meticulous choice of stepsizes, which is however a
common bottleneck in subgradient algorithms and successive convex approximation
algorithms. Finally, the proposed algorithm is numerically tested.Comment: Submitted to IEEE ICASSP 201
A Unified Successive Pseudo-Convex Approximation Framework
In this paper, we propose a successive pseudo-convex approximation algorithm
to efficiently compute stationary points for a large class of possibly
nonconvex optimization problems. The stationary points are obtained by solving
a sequence of successively refined approximate problems, each of which is much
easier to solve than the original problem. To achieve convergence, the
approximate problem only needs to exhibit a weak form of convexity, namely,
pseudo-convexity. We show that the proposed framework not only includes as
special cases a number of existing methods, for example, the gradient method
and the Jacobi algorithm, but also leads to new algorithms which enjoy easier
implementation and faster convergence speed. We also propose a novel line
search method for nondifferentiable optimization problems, which is carried out
over a properly constructed differentiable function with the benefit of a
simplified implementation as compared to state-of-the-art line search
techniques that directly operate on the original nondifferentiable objective
function. The advantages of the proposed algorithm are shown, both
theoretically and numerically, by several example applications, namely, MIMO
broadcast channel capacity computation, energy efficiency maximization in
massive MIMO systems and LASSO in sparse signal recovery.Comment: submitted to IEEE Transactions on Signal Processing; original title:
A Novel Iterative Convex Approximation Metho
Interference Exploitation-based Hybrid Precoding with Robustness Against Phase Errors
Hybrid analog-digital precoding significantly reduces the hardware costs in
massive MIMO transceivers when compared to fully-digital precoding at the
expense of increased transmit power. In order to mitigate the above shortfall,
we use the concept of constructive interference-based precoding, which has been
shown to offer significant transmit power savings when compared with the
conventional interference suppression-based precoding in fully-digital
multiuser MIMO systems. Moreover, in order to circumvent the potential
quality-of-service degradation at the users due to the hardware impairments in
the transmitters, we judiciously incorporate robustness against such
vulnerabilities in the precoder design. Since the undertaken constructive
interference-based robust hybrid precoding problem is nonconvex with infinite
constraints and thus difficult to solve optimally, we decompose the problem
into two subtasks, namely, analog precoding and digital precoding. In this
paper, we propose an algorithm to compute the optimal constructive
interference-based robust digital precoders. Furthermore, we devise a scheme to
facilitate the implementation of the proposed algorithm in a low-complexity and
distributed manner. We also discuss block-level analog precoding techniques.
Simulation results demonstrate the superiority of the proposed algorithm and
its implementation scheme over the state-of-the-art methods
A Compact Formulation for the Mixed-Norm Minimization Problem
Parameter estimation from multiple measurement vectors (MMVs) is a
fundamental problem in many signal processing applications, e.g., spectral
analysis and direction-of- arrival estimation. Recently, this problem has been
address using prior information in form of a jointly sparse signal structure. A
prominent approach for exploiting joint sparsity considers mixed-norm
minimization in which, however, the problem size grows with the number of
measurements and the desired resolution, respectively. In this work we derive
an equivalent, compact reformulation of the mixed-norm
minimization problem which provides new insights on the relation between
different existing approaches for jointly sparse signal reconstruction. The
reformulation builds upon a compact parameterization, which models the
row-norms of the sparse signal representation as parameters of interest,
resulting in a significant reduction of the MMV problem size. Given the sparse
vector of row-norms, the jointly sparse signal can be computed from the MMVs in
closed form. For the special case of uniform linear sampling, we present an
extension of the compact formulation for gridless parameter estimation by means
of semidefinite programming. Furthermore, we derive in this case from our
compact problem formulation the exact equivalence between the
mixed-norm minimization and the atomic-norm minimization. Additionally, for the
case of irregular sampling or a large number of samples, we present a low
complexity, grid-based implementation based on the coordinate descent method
Partial Relaxation Approach: An Eigenvalue-Based DOA Estimator Framework
In this paper, the partial relaxation approach is introduced and applied to
DOA estimation using spectral search. Unlike existing methods like Capon or
MUSIC which can be considered as single source approximations of multi-source
estimation criteria, the proposed approach accounts for the existence of
multiple sources. At each considered direction, the manifold structure of the
remaining interfering signals impinging on the sensor array is relaxed, which
results in closed form estimates for the interference parameters. The
conventional multidimensional optimization problem reduces, thanks to this
relaxation, to a simple spectral search. Following this principle, we propose
estimators based on the Deterministic Maximum Likelihood, Weighted Subspace
Fitting and covariance fitting methods. To calculate the pseudo-spectra
efficiently, an iterative rooting scheme based on the rational function
approximation is applied to the partial relaxation methods. Simulation results
show that the performance of the proposed estimators is superior to the
conventional methods especially in the case of low Signal-to-Noise-Ratio and
low number of snapshots, irrespectively of any specific structure of the sensor
array while maintaining a comparable computational cost as MUSIC.Comment: This work has been submitted to IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks
In this paper, we propose a novel single-group multicasting relay beamforming
scheme. We assume a source that transmits common messages via multiple
amplify-and-forward relays to multiple destinations. To increase the number of
degrees of freedom in the beamforming design, the relays process two received
signals jointly and transmit the Alamouti space-time block code over two
different beams. Furthermore, in contrast to the existing relay multicasting
scheme of the literature, we take into account the direct links from the source
to the destinations. We aim to maximize the lowest received quality-of-service
by choosing the proper relay weights and the ideal distribution of the power
resources in the network. To solve the corresponding optimization problem, we
propose an iterative algorithm which solves sequences of convex approximations
of the original non-convex optimization problem. Simulation results demonstrate
significant performance improvements of the proposed methods as compared with
the existing relay multicasting scheme of the literature and an algorithm based
on the popular semidefinite relaxation technique
MIMO Radar Target Localization and Performance Evaluation under SIRP Clutter
Multiple-input multiple-output (MIMO) radar has become a thriving subject of
research during the past decades. In the MIMO radar context, it is sometimes
more accurate to model the radar clutter as a non-Gaussian process, more
specifically, by using the spherically invariant random process (SIRP) model.
In this paper, we focus on the estimation and performance analysis of the
angular spacing between two targets for the MIMO radar under the SIRP clutter.
First, we propose an iterative maximum likelihood as well as an iterative
maximum a posteriori estimator, for the target's spacing parameter estimation
in the SIRP clutter context. Then we derive and compare various
Cram\'er-Rao-like bounds (CRLBs) for performance assessment. Finally, we
address the problem of target resolvability by using the concept of angular
resolution limit (ARL), and derive an analytical, closed-form expression of the
ARL based on Smith's criterion, between two closely spaced targets in a MIMO
radar context under SIRP clutter. For this aim we also obtain the non-matrix,
closed-form expressions for each of the CRLBs. Finally, we provide numerical
simulations to assess the performance of the proposed algorithms, the validity
of the derived ARL expression, and to reveal the ARL's insightful properties.Comment: 34 pages, 12 figure
Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations
In this paper, we propose a successive convex approximation framework for
sparse optimization where the nonsmooth regularization function in the
objective function is nonconvex and it can be written as the difference of two
convex functions. The proposed framework is based on a nontrivial combination
of the majorization-minimization framework and the successive convex
approximation framework proposed in literature for a convex regularization
function. The proposed framework has several attractive features, namely, i)
flexibility, as different choices of the approximate function lead to different
type of algorithms; ii) fast convergence, as the problem structure can be
better exploited by a proper choice of the approximate function and the
stepsize is calculated by the line search; iii) low complexity, as the
approximate function is convex and the line search scheme is carried out over a
differentiable function; iv) guaranteed convergence to a stationary point. We
demonstrate these features by two example applications in subspace learning,
namely, the network anomaly detection problem and the sparse subspace
clustering problem. Customizing the proposed framework by adopting the
best-response type approximation, we obtain soft-thresholding with exact line
search algorithms for which all elements of the unknown parameter are updated
in parallel according to closed-form expressions. The attractive features of
the proposed algorithms are illustrated numerically.Comment: submitted to IEEE Journal of Selected Topics in Signal Processing,
special issue in Robust Subspace Learnin
Angular resolution limit for deterministic correlated sources
This paper is devoted to the analysis of the angular resolution limit (ARL),
an important performance measure in the directions-of-arrival estimation
theory. The main fruit of our endeavor takes the form of an explicit,
analytical expression of this resolution limit, w.r.t. the angular parameters
of interest between two closely spaced point sources in the far-field region.
As by-products, closed-form expressions of the Cram\'er-Rao bound have been
derived. Finally, with the aid of numerical tools, we confirm the validity of
our derivation and provide a detailed discussion on several enlightening
properties of the ARL revealed by our expression, with an emphasis on the
impact of the signal correlation
- …